On the Relaxed Colouring Game and the Unilateral Colouring Game
نویسندگان
چکیده
منابع مشابه
Game Colouring Directed Graphs
In this paper, a colouring game and two versions of marking games (the weak and the strong) on digraphs are studied. We introduce the weak game chromatic number χwg(D) and the weak game colouring number wgcol(D) of digraphs D. It is proved that if D is an oriented planar graph, then χwg(D) 6 wgcol(D) 6 9, and if D is an oriented outerplanar graph, then χwg(D) 6 wgcol(D) 6 4. Then we study the s...
متن کاملColouring game and generalized colouring game on graphs with cut-vertices
For k ≥ 2 we define a class of graphs Hk = {G : every block of G has at most k vertices}. The class Hk contains among other graphs forests, Husimi trees, line graphs of forests, cactus graphs. We consider the colouring game and the generalized colouring game on graphs from Hk.
متن کاملGame List Colouring of Graphs
We consider the two-player game defined as follows. Let (G,L) be a graph G with a list assignment L on its vertices. The two players, Alice and Bob, play alternately on G, Alice having the first move. Alice’s goal is to provide an L-colouring of G and Bob’s goal is to prevent her from doing so. A move consists in choosing an uncoloured vertex v and assigning it a colour from the set L(v). Adjac...
متن کاملGeneralised game colouring of graphs
We consider the version of a colouring game introduced by Bodlaender [On the complexity of some colorings games, Internat. J. Found. Comput. Sci. 2 (1991) 133–147]. We combine the concepts: this game and the generalised colouring of graphs as follows. The two players are Alice and Bob and they play alternatively with Alice having the first move. Let be given a graph G and an ordered set of here...
متن کاملThe neighbour-sum-distinguishing edge-colouring game
Let γ : E(G) −→ N∗ be an edge colouring of a graph G and σγ : V (G) −→ N∗ the vertex colouring given by σγ(v) = ∑ e3v γ(e) for every v ∈ V (G). A neighbour-sumdistinguishing edge-colouring of G is an edge colouring γ such that for every edge uv in G, σγ(u) 6= σγ(v). The study of neighbour-sum-distinguishing edge-colouring of graphs was initiated by Karoński, Łuczak and Thomason [8]. They conjec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2013
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-013-1326-8